The Parameterized Suffix Tray

Let \(\varSigma \) and \(\varPi be disjoint alphabets, respectively called the static alphabet parameterized alphabet. Two strings x y over \cup \varPi of equal length are said to match (p-match) if there exists a renaming bijection f on which is identity maps characters those so that two become identical. The indexing version problem finding p-matching occurrences given pattern in text well-studied topic string matching. In this paper, we present state-of-the-art structure for suffix tray an input T, denoted by \(\mathsf {PSTray}(T)\). We show {PSTray}(T)\) occupies O(n) space supports matching queries \(O(m + \log (\sigma +\pi ) occ )\) time, where n t, m query P, \(\pi number distinct symbols \(|\varPi |\) \(\sigma \(|\varSigma T \( P T. also how build time from tree